Maximum flow problem

Results: 146



#Item
81Combinatorics / Flow network / Ford–Fulkerson algorithm / Maximum flow problem / Max-flow min-cut theorem / Cut / Network flow / Graph theory / Mathematics

COMBINATORIAL BOOTSTRAP INFERENCE IN PARTIALLY IDENTIFIED INCOMPLETE STRUCTURAL MODELS: SUPPLEMENTARY MATERIAL MARC HENRY, ROMUALD MEANGO AND MAURICE QUEYRANNE 1. Min-Cut Max-Flow Theorem

Add to Reading List

Source URL: qeconomics.org

Language: English - Date: 2014-11-24 16:20:38
82Operations research / Linear programming / Algorithms / Randomized rounding / Linear programming relaxation / Maximum flow problem / Chernoff bound / Randomized algorithm / Mathematics / Mathematical optimization / Applied mathematics

Designing Overlay Multicast Networks For Streaming Konstantin Andreev∗ Bruce M. Maggs† Adam Meyerson‡

Add to Reading List

Source URL: www.akamai.com

Language: English - Date: 2006-09-21 21:38:54
83Tree decomposition / Maximum flow problem / Flow network / Connectivity / Path decomposition / Branch-decomposition / Graph theory / Network flow / Graph operations

Simultaneous Source Location Konstantin Andreev1? , Charles Garrod1? , Bruce Maggs1 , and Adam Meyerson2? 1 2

Add to Reading List

Source URL: www.akamai.com

Language: English - Date: 2006-09-21 21:38:54
84Network flow / Graph connectivity / Operations research / Maximum flow problem / Max-flow min-cut theorem / Flow network / Graph / Cut / Minimum cut / Graph theory / Mathematics / Combinatorial optimization

Capacitated Network Design on Undirected Graphs Deeparnab Chakrabarty∗ Ravishankar Krishnaswamy† Shi Li‡

Add to Reading List

Source URL: www.cs.cmu.edu

Language: English - Date: 2013-06-17 04:09:52
85Combinatorics / Combinatorial optimization / Flow network / Cluster analysis / Max-flow min-cut theorem / Cut / Minimum-cost flow problem / Maximum flow problem / CURE data clustering algorithm / Graph theory / Network flow / Mathematics

Cluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient Routing Ravishankar Krishnaswamy∗ Viswanath Nagarajan†

Add to Reading List

Source URL: www.cs.cmu.edu

Language: English - Date: 2013-11-12 10:28:36
86Search algorithms / Combinatorial optimization / Routing algorithms / Operations research / Network theory / A* search algorithm / Shortest path problem / Flow network / Tree / Graph theory / Mathematics / Theoretical computer science

Maximum Gain Round Trips with Cost Constraints Franz Graf, Hans-Peter Kriegel, Matthias Schubert arXiv:1105.0830v1 [cs.SI] 4 May 2011

Add to Reading List

Source URL: www.dbs.ifi.lmu.de

Language: English - Date: 2011-05-05 02:44:43
87Formal methods / Mathematics / Network flow / Retiming / Electronic design automation / Electronic design / Maximum flow problem / Design closure / Clock skew / Electronic engineering / Operations research / Electronics

1 Scalable Min-Register Retiming Under Timing and Initializability Constraints Aaron P. Hurst, Alan Mishchenko, and Robert K. Brayton University of California, Berkeley

Add to Reading List

Source URL: www.bvsrc.org

Language: English - Date: 2008-04-03 12:04:29
88Theoretical computer science / Shortest path problem / Histogram / Maximum flow problem / Flow network / Minimum-cost flow problem / Matching / Mathematics / Graph theory / Network flow

Earth Mover’s Distance based Similarity Search at Scale Yu Tang† , Leong Hou U‡ , Yilun Cai† , Nikos Mamoulis† , Reynold Cheng† † † {ytang,

Add to Reading List

Source URL: www.vldb.org

Language: English - Date: 2013-11-07 15:10:21
89Dynamics / Piping / Reynolds number / Laminar flow / Turbulence / Aerodynamics / Fluid mechanics / Fluid dynamics

Department of Automatic Control & Systems Engineering would like to announce the following seminar: Minimizing Maximum Transient Energy - a Problem in Fluid Flow Control Speaker: Dr James F Whidborne

Add to Reading List

Source URL: www.sheffield.ac.uk

Language: English - Date: 2011-07-19 20:20:18
90Network flow / Combinatorial optimization / Search algorithms / PageRank / Cut / Flow network / Maximum flow problem / Algorithm / Hyperlink / Mathematics / Graph theory / Theoretical computer science

RESEARCH FEATURE Self-Organization and Identification of Web Communities Despite its decentralized and unorganized nature, the Web self-organizes

Add to Reading List

Source URL: snap.stanford.edu

Language: English - Date: 2011-12-04 14:11:42
UPDATE